Summation of binary codes without carry

Spectra and Efficiency of Binary Codes Without DC

In digital transmission of binary (+l, 1 ) signals it is desirable that the stream of pulses which constitutes the signal have no dc, that is, that the power spectrum go to zero at zero frequency. It is desuable that, for a given efficiency or entropy, the spectrum rise slowly with increasing frequency. We have obtained the spectrum for selected blocks with equal numbers of plus ones and minus ...

Fast Multiplication Without Carry-Propagate Addition

Reverse Engineering of Network Software Binary Codes for Identification of Syntax and Semantics of Protocol Messages

Reverse engineering of network applications especially from the security point of view is of high importance and interest. Many network applications use proprietary protocols which specifications are not publicly available. Reverse engineering of such applications could provide us with vital information to understand their embedded unknown protocols. This could facilitate many tasks including d...

Codes Derived from Binary Goppa Codes

We present a new family of binary codes derived from the family of classical Goppa codes. We generalize properties of Goppa codes to this family and deduce bounds on the dimension and on the minimum distance, and the existence of a polynomial-time decoding algorithm up to a constructed error-correcting capability. Asymptotically these codes have the same parameters as Goppa codes.

Nonrandom binary superimposed codes

PI W. W. Peterson, “Error-Correcting Codes,” John Wiley and Sons, Inc., New York, N. Y.; 1961. E. Gorog, ‘(Some new classes of cyclic codes used for burst-error correction,” IBM J. Res. Developm., vol. 7, pp. 102-111; April, 1963. R. C. Bose and C. R. Ray-Chaudhuri, “On a class of errorcorrecting binary group codes,” Information and Control, vol. 3, pp. 68-79; 1960. A. Hocquenghem, “Codes corre...